Oracle Semantics for Prolog

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Oracle Semantics for Prolog

This paper proposes to specify semantic de nitions for logic programming languages such as Prolog in terms of an oracle which speci es the control strategy and identi es which clauses are to be applied to resolve a given goal. The approach is quite general. It is applicable to Prolog to specify both operational and declarative semantics as well as other logic programming languages. Previous sem...

متن کامل

Resultants Semantics for Prolog

In this paper we study some rst order formulas, called resultants, which can be used to describe in a concise way most of the relevant information associated to SLD-derivations. We rst extend to resultants some classical results of logic programming theory. Then we deene a xpoint semantics for Prolog computed resultants, i.e. those formulas which are obtained by considering the leftmost selecti...

متن کامل

Oracle Semantics

We define a Concurrent Separation Logic with first-class locks and threads for the C language, and prove its soundness in Coq with respect to a compilable operataional semantics. We define the language Concurrent C minor, an extension of the C minor language of Leroy. C minor was designed as the highest-level intermediate language in the CompCert certified ANSI C compiler, and we add to it lock...

متن کامل

A Denotational Semantics for Prolog

analysis is nite, which was not the case in our previous proposal [13]. The overheadneeded for reaching an improved precision essentially consists in the use of observability andkernel constraints and of their success and failure conditions.We can now consider the already mentioned paper [11]. A big di erence arises lookingfor instance at the way they handle clause composition a...

متن کامل

Oracle game semantics for the nu-calculus

The long-standing problem of giving fully abstract semantics to the nu-calculus have been solved only recently with game models à la Hyland-Ong in the universe of Fraenkel-Mostowski sets. However, these models are still quite complicated, mainly because they aim to ensure at once both the equivariance of strategies, and the possibility of having strategies generating new names. In this paper, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Computation

سال: 1995

ISSN: 0890-5401

DOI: 10.1006/inco.1995.1146